Assembly modelling by geometric constraint satisfaction
نویسندگان
چکیده
A new approach for representing and reasoning about assemblies of mechanical parts has been developed. The approach combines a formalism for representing relationships among features with a new method for geometric constraint satisfaction. The method employs symbolic reasoning about the geometric structure of parts to solve spatial constraints between the parts, in contrast to other approaches that reduce the geometric relationships to a set of non-linear equations to be solved. The system characterizes over-, under-, and fullyconstrained assemblies. For under-constrained assemblies, the remaining degrees of freedom are automatically coalesced into a set of kinematic joints that capture some of the functionality of the assembly. For over-constrained situations, redundant constraints are identified and checked for consistency, and degenerate cases are handled; this allows multiple feature relationships between two parts to be handled. A computer implementation in a limited feature domain is described and used to illustrate the approach with an example. Copyright
منابع مشابه
Interactive Assembly Modelling within a CAVE Environment
This paper presents the design and implementation of a constraint-based virtual environment for supporting interactive assembly and maintenance tasks within an immersive virtual reality environment. The system architecture of the constraint-based virtual environment is based on the integration of components such as OpenGL Optimizer, Parasolid geometric kernel, a Constraint Engine and an Assembl...
متن کاملSymmetiy Constraint Inference in Assembly Planning: Automatic Assembly Configuration Specification
In this paper we shall discuss how to treat the automatic generation of assembly task specifications as a constraint satisfaction problem (CSP) over finite and infinite domains. Conceptually it is straightforward to formulate assembly planning in terms of CSP, however the choice of constraint representation and of the order in which the constraints are applied is nontrivial if a computationally...
متن کاملSolving 3D Geometric Constraints for Assembly Modelling
A geometric constraint solving method is presented that takes well-constrained mating conditions between a base and a mating component and directly transforms them into a 4 × 4 matrix that determines the relative orientation and location of the mating component with respect to the base component. In the proposed procedure, the 4 × 4 transformation matrix is determined by directly computing a ro...
متن کاملA Two-body Solver for Assembly Modelling
Assembly modelling deals with the spatial joining of rigid bodies in 3D-space for which constraint based modelling is a proven approach. The existing geometric constraint solvers do not satisfy all needs, there are still challenges for research. The two-body-problem (constraint intersection) and the three-body-problem (constraint composition) are subproblems which have exploitable properties on...
متن کاملInteractive Aspects of Constraint-based Assembly Modeling
Generally, constraint satisfaction problems (CSP) are NP-complete. Many subclasses, however, can be solved eeciently. They are mainly deened by properties of the variable domains, the constraint semantics, the constraint graph structures or a combination of those. In this paper, we consider a new aspect of making a CSP feasible, namely the dynamic essence of the problem modeling process. As a c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer-Aided Design
دوره 28 شماره
صفحات -
تاریخ انتشار 1996